Bicriteria scheduling of a two-machine flowshop with sequence-dependent setup times
نویسندگان
چکیده
منابع مشابه
Flowshop Schedules with Sequence Dependent Setup Times
The flowshop scheduling problem with sequence dependent setup times is considered and shown to be NP-complete. A traveling salesman problem formulation is proposed for the case where jobs are processed continuously through the shop. These results are used to describe an approximate algorithm for the case where limited or infinite intermediate storage space is available to hold partially complet...
متن کاملBatch Scheduling on Two-Machine Flowshop with Machine-Dependent Setup Times
The recent survey paper “A Survey on Scheduling Problems with Setup Times and Costs” 1 , classifies batch scheduling problems into those with batching and nonbatching considerations, with sequence-independent and sequence-dependent setup times, and according to the machine environment and the objective function. The survey contains approximately 300 references, a clear indication of the importa...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملBi-criteria Scheduling of a Flowshop Manufacturing Cell with Sequence Dependent Setup Times
This paper considers a flowshop scheduling problem of a manufacturing cell that contains families of jobs whose setup times are dependent on the manufacturing ............ sequence of the families. Two objectives, namely the makespan and total flow time, have been considered simultaneously in this work. Since minimization of each of these two objectives is an NpHard problem, a Multi-Objective G...
متن کاملNon-permutation flowshop scheduling in a supply chain with sequence-dependent setup times
In this paper, we consider a flowshop scheduling problem with sequence-dependent setup times and a bicriteria objective to minimize the work-in-process inventory for the producer and to maximize the customers’ service level. The use of a bicriteria objective is motivated by the fact that successful companies in today’s environment not only try to minimize their own cost but also try to fulfill ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Journal of Advanced Manufacturing Technology
سال: 2008
ISSN: 0268-3768,1433-3015
DOI: 10.1007/s00170-008-1439-z